Cutting Corners in the Mediastinum

Cutting Corners

Cutting Corners: Workbench Automation for Server Benchmarking

A common approach to benchmarking a server is to measure its behavior under load from a workload generator. Often a set of such experiments is required— perhaps with different server configurations or workload parameters—to obtain a statistically sound result for a given benchmarking objective. This paper explores a framework and policies to conduct such benchmarking activities automatically an...

Finding the Minimum-Cost Path Without Cutting Corners

Applying a minimum-cost path algorithm to find the path through the bottom of a curvilinear valley yields a biased path through the inside of a corner. DNA molecules, blood vessels, and neurite tracks are examples of string-like (network) structures, whose minimum-cost path is cutting through corners and is less flexible than the underlying centerline. Hence, the path is too short and its shape...

Cutting corners cheaply, or how to remove Steiner points

Our main result is that the Steiner point removal (SPR) problem can always be solved with polylogarithmic distortion, which answers in the affirmative a question posed by Chan, Xia, Konjevod, and Richa in 2006. Specifically, we prove that for every edge-weighted graph G = (V, E,w) and a subset of terminals T ⊆ V , there is a graph G′ = (T, E′, w′) that is isomorphic to a minor of G such that fo...

Generating Random Numbers from a Unimodal Density by Cutting Corners

The cutting corners algorithm can be used to generate random numbers from any unimodal density which is speciied only as a computer subroutine. This allows for a single program that can generate samples from Normal, Exponential, Gamma, Cauchy,. .. , and almost any of your favorite density with any parameters. Despite the extremely open nature of the problem, the algorithm proposed is extremely ...